数据不平衡，即来自不同课程的培训观测数量之间的歧视，仍然是影响当代机器学习的最重要挑战之一。数据预处理技术可以减少数据不平衡对传统分类算法的负面影响，可以减少操纵训练数据以人为地降低不平衡程度的方法。然而，现有的数据预处理技术，特别是粉迹及其衍生物构成最普遍的数据预处理的范式，往往易于各种数据难度因素。这部分是由于原始粉碎算法不利用有关多数类观察的信息的事实。本文的重点是利用少数群体和多数阶级的分布的信息，自然地发展新的数据重采样策略。本文总结了12个研究论文的内容，专注于所提出的二进制数据重采采样策略，它们与多级环境的翻译，以及对组织病理数据分类问题的实际应用。

The celebrated FedAvg algorithm of McMahan et al. (2017) is based on three components: client sampling (CS), data sampling (DS) and local training (LT). While the first two are reasonably well understood, the third component, whose role is to reduce the number of communication rounds needed to train the model, resisted all attempts at a satisfactory theoretical explanation. Malinovsky et al. (2022) identified four distinct generations of LT methods based on the quality of the provided theoretical communication complexity guarantees. Despite a lot of progress in this area, none of the existing works were able to show that it is theoretically better to employ multiple local gradient-type steps (i.e., to engage in LT) than to rely on a single local gradient-type step only in the important heterogeneous data regime. In a recent breakthrough embodied in their ProxSkip method and its theoretical analysis, Mishchenko et al. (2022) showed that LT indeed leads to provable communication acceleration for arbitrarily heterogeneous data, thus jump-starting the $5^{\rm th}$ generation of LT methods. However, while these latest generation LT methods are compatible with DS, none of them support CS. We resolve this open problem in the affirmative. In order to do so, we had to base our algorithmic development on new algorithmic and theoretical foundations.

We leverage probabilistic models of neural representations to investigate how residual networks fit classes. To this end, we estimate class-conditional density models for representations learned by deep ResNets. We then use these models to characterize distributions of representations across learned classes. Surprisingly, we find that classes in the investigated models are not fitted in an uniform way. On the contrary: we uncover two groups of classes that are fitted with markedly different distributions of representations. These distinct modes of class-fitting are evident only in the deeper layers of the investigated models, indicating that they are not related to low-level image features. We show that the uncovered structure in neural representations correlate with memorization of training examples and adversarial robustness. Finally, we compare class-conditional distributions of neural representations between memorized and typical examples. This allows us to uncover where in the network structure class labels arise for memorized and standard inputs.

Hierarchical decomposition of control is unavoidable in large dynamical systems. In reinforcement learning (RL), it is usually solved with subgoals defined at higher policy levels and achieved at lower policy levels. Reaching these goals can take a substantial amount of time, during which it is not verified whether they are still worth pursuing. However, due to the randomness of the environment, these goals may become obsolete. In this paper, we address this gap in the state-of-the-art approaches and propose a method in which the validity of higher-level actions (thus lower-level goals) is constantly verified at the higher level. If the actions, i.e. lower level goals, become inadequate, they are replaced by more appropriate ones. This way we combine the advantages of hierarchical RL, which is fast training, and flat RL, which is immediate reactivity. We study our approach experimentally on seven benchmark environments.

持续学习系统将知识从先前看到的任务转移以最大程度地提高新任务的能力是该领域的重大挑战，从而限制了持续学习解决方案对现实情况的适用性。因此，本研究旨在扩大我们在不断加强学习的特定情况下对转移及其驱动力的理解。我们采用SAC作为基础RL算法和持续的世界作为连续控制任务的套件。我们系统地研究SAC（演员和评论家，勘探和数据）的不同组成部分如何影响转移功效，并提供有关各种建模选项的建议。在最近的连续世界基准中评估了最佳的选择，即称为clonex-sac。 Clonex-SAC获得了87％的最终成功率，而Packnet的80％是基准中的最佳方法。此外，根据连续世界提供的指标，转移从0.18增至0.54。

素描和项目是一个框架，它统一了许多已知的迭代方法来求解线性系统及其变体，并进一步扩展了非线性优化问题。它包括流行的方法，例如随机kaczmarz，坐标下降，凸优化的牛顿方法的变体等。在本文中，我们通过新的紧密频谱边界为预期的草图投影矩阵获得了素描和项目的收敛速率的敏锐保证。我们的估计值揭示了素描和项目的收敛率与另一个众所周知但看似无关的算法家族的近似误差之间的联系，这些算法使用草图加速了流行的矩阵因子化，例如QR和SVD。这种连接使我们更接近准确量化草图和项目求解器的性能如何取决于其草图大小。我们的分析不仅涵盖了高斯和次高斯的素描矩阵，还涵盖了一个有效的稀疏素描方法，称为较少的嵌入方法。我们的实验备份了理论，并证明即使极稀疏的草图在实践中也显示出相同的收敛属性。

在针对自闭症谱系障碍患者的机器人辅助治疗中，如果必须手动控制机器人，则在治疗过程中的治疗师工作量会增加。为了允许治疗师专注于与人的互动，机器人应该更加自主，即它应该能够解释该人的状态并根据其行为不断适应其行为。在本文中，我们开发了一个个性化的机器人行为模型，该模型可以在活动期间的机器人决策过程中使用。该行为模型是在从真实交互数据中学到的用户模型的帮助下训练的。我们将Q学习用于此任务，因此结果表明该策略需要大约10,000次迭代才能收敛。因此，我们调查了改善收敛速度的政策转移；我们表明这是一个可行的解决方案，但是不适当的初始政策可以导致最终的最终回报。

我们提出了一种利用分布人工神经网络的概率电价预测（EPF）的新方法。EPF的新型网络结构基于包含概率层的正则分布多层感知器（DMLP）。使用TensorFlow概率框架，神经网络的输出被定义为一个分布，是正常或可能偏斜且重尾的Johnson的SU（JSU）。在预测研究中，将该方法与最新基准进行了比较。该研究包括预测，涉及德国市场的日常电价。结果显示了对电价建模时较高时刻的重要性的证据。

我们引入了一种内部重播的新方法，该方法根据网络深度调节排练的频率。虽然重播策略减轻了神经网络中灾难性遗忘的影响，但最近对生成重播的作品表明，仅在网络的更深层次上进行排练才能改善持续学习的性能。但是，生成方法引入了其他计算开销，从而限制了其应用程序。通过观察到的神经网络的早期层次忘记忘记了，我们建议在重播过程中使用中级功能更新频率不同的网络层。这通过省略了发电机的更深层和主要模型的早期层来减少计算负担。我们命名我们的方法渐进式潜在重播，并表明它在使用较少的资源时表现优于内部重播。

时间序列预测是许多人类活动的关键任务，例如天气预报或预测股价。解决此问题的一种解决方案是使用复发性神经网络（RNN）。尽管它们可以产生准确的预测，但他们的学习过程缓慢而复杂。在这里，我们提出了一个量子复发的神经网络（QRNN）来解决这些障碍。网络的设计基于连续变量的量子计算范式。我们证明网络能够学习一些类型的时间数据的时间依赖性。我们的数值模拟表明，与经典网络相比，QRNN收敛到最佳权重。此外，对于少数可训练的参数，它可以实现比后者更低的损失。